Towards E cient Modelling of Distributed Knowledge Using Equational and Order-Sorted Logic

نویسنده

  • Renata Wassermann
چکیده

Reasoning about multiple interacting agents is important for many areas of research such as distributed computing, artiicial intelligence, game theory, decision theory, cognitive science, economics and psychology. J. Y. Halpern and colleagues HM90, HF89, HT93] have proposed the use of multiagent epistemic logics to formalise reasoning about multiple agents. In the present paper we extend their proposal to allow grouping of agents, and propose a strategy to build eecient resolution-based logic programs for automated reasoning about interacting agents.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Eecient Modelling of Distributed Knowledge Using Equational and Order-sorted Logic

Reasoning about multiple interacting agents is important for many areas of research such as distributed computing, artiicial intelligence , game theory, decision theory, cognitive science, economics and psychology. J. Y. Halpern and colleagues HM90, HF89, HT93] have proposed the use of multiagent epistemic logics to formalise reasoning about multiple agents. In the present paper we extend their...

متن کامل

Towards Behavioral Maude: Behavioral Membership Equational Logic

How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...

متن کامل

An E cient Constraint Language for Polymorphic Order-sorted Resolution

In recent years various sorted logics have been developed, mostly to facilitate knowledge representation and to speed up automated deduction. We present a polymorphic order-sorted logic that can be implemented e ciently. Because the polymorphism is almost unrestricted, it is possible for two terms to have an exponential number of maximally general uni ers. To guarantee a single most general uni...

متن کامل

The Institution of Order-Sorted Equational Logic

The paper provides an organisation of order-sorted equational logic as an Institution.

متن کامل

Presenting functors on many-sorted varieties and applications

This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of this notion from the one-sorted to the many-sorted case has several interesting consequences. First, it can be applied to give equational logic for the binding algebras modelling abstract syntax. Second, it provides a ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994